Method and apparatus for modeling specular reflection

ABSTRACT

A method and apparatus for modeling the specular reflection of light from an object is disclosed. In accordance with one embodiment of the method, a portion of the object is modeled by one or more surfaces each having at least one vertex and an edge point corresponding to an edge. A sine value associated with a highlight angle is determined at each vertex and edge point, and a control value is determined at each vertex and edge point using the sine values. A specular input component at each point on the surface is determined using the control values. The specular input component is utilized to determine the specular light component at that particular point. Embodiments of apparatus implementing the method are also disclosed.

FIELD OF THE INVENTION

[0001] The invention relates to a method and an apparatus for modeling the specular reflection of light from a surface.

BACKGROUND OF THE INVENTION

[0002] Computer generated images are created from models of objects. It is desirable that the object depicted in a computer generated image resemble the real object to the maximum extent possible. In some instances, the real object specularly reflects light. That is, when viewed at one or more angles, the object reflects light directly from a light source to the viewer. This specularly reflected light appears as a shiny area on the surface of the object.

[0003] As an example, when light is projected onto the outer waxy surface of an apple, at one or more angles the light is directly reflected from a source to the viewer and appears as a shiny spot on the apple. In order to graphically portray the image of an apple, it is desirable to display the “shiny spot” on the image of the apple which one would see if viewing the apple in real life.

[0004] One method for modeling the specular reflection associated with an object is to utilize a modified version of Gouraud shading. This method will be described with reference to FIG. 1.

[0005] First, the surface to be imaged is divided into a number of polygons, such as triangles, the polygons having common vertices. Vectors normal to the surface N₁, N₂, N₃ are calculated at each vertex V₁, V₂, V₃. Using these normal vectors, the light intensity I₁, I₂, I₃ at each vertex V₁, V₂, V₃ is calculated with a light intensity equation. One such equation which accounts for the light intensity from ambient, diffuse and specular components is the equation I=I_(a)*k_(a)+Ii*[k_(d)(L·N)+k_(s)(R·V)^(n)].

[0006] In this equation, I_(a)*k_(a) represents the ambient light intensity component and k_(d)(L·N) is the diffuse light intensity component. These components, while not necessary to the calculation of the specularly reflected light component, are instrumental in generating an image which accounts for light which impinges on the object from a variety of sources (the ambient component) and the light which impinges on the object from a particular source and is diffusely reflected (the diffuse component). In this portion of the equation, the ambient intensity component is dependent upon the ambient light intensity I_(a), while the diffuse component is dependent upon the intensity I_(i) of a particular light source. The term k_(s)(R·V)^(n) is the specularly reflected light intensity component, which is also dependent upon the light source intensity I_(i).

[0007] In the equation, k_(a), k_(d) and k_(s) are the ambient, diffuse and specular reflection constants. The value of these constants depends upon a number of factors, such as the texture of the surface which is being modeled or imaged.

[0008] L is the light vector, V is the viewing vector and R is the reflection vector. One arrangement of the inter-relationship of the L, V and R vectors is illustrated in FIG. 2. In accordance with this light intensity equation, the dot product of the vectors R and V (i.e. R·V) represents the cosine of the angle between the two vectors. The R vector may be calculated in accordance with the equation R=2*(N·L)*N−L. Likewise, the dot product of the vectors L and N (i.e. L·N) represents the cosine of the angle between these two vectors.

[0009] In accordance with the Gouraud method, once the intensity of the light is calculated at each vertex of the polygon, the intensity of the light is then linearly interpolated to each other point on the polygon (each point corresponding to a display pixel). For example, referring again to FIG. 1, the light intensity I₄ at a point P₄ along a scan line SL is interpolated by first interpolating the light intensities I₅ and I₆ at the intersection of the scan line with the polygon edges at points P₅ and P₆. The intensities I₅ and I₆ are interpolated from the intensities I₁ and I₃, and I₂ and I₃ at the vertices, respectively. The intensity I₄ is then interpolated from the light intensities I₅ and I₆.

[0010] This method is discussed in Gouraud, “Continuous Display of Curved Surfaces,” Ph. D. dissertation, Department of Computer Science, University of Utah, Salt Lake City, June 1971. This method is also discussed generally in “Fundamentals of Interactive Computer Graphics” by Foley, Van Dam and Addison-Wesley, 1984.

[0011] This method of calculating the specularly reflected light component has several problems. A first problem is that if no specular reflection component is present at a vertex of the polygon, then no specular reflection component will be yielded anywhere in that portion of the image derived from that polygon. This is the case since the specular component at all non-vertex points of the polygon are interpolated from the specular component at the vertices. In addition, this method may result in exaggerated intensity changes at discontinuities. As a result, the imaged object may not appear as the actual object would appear.

[0012] Another problem with this method is that the specular component is based upon the dot product of the R and V vectors. In other words, the specular component is based upon the cosine of the angle between these vectors. As is well known, the cosine function changes little at angles near 0 degrees. On the other hand, specular reflection only occurs at angles near 0 degrees. So that the specular function transitions smoothly from angles near 0 degrees to larger angles where no reflection is visible, the differences in the cosine values at these angles must be exaggerated. This can be accomplished by raising the cosine value by a power n. On the other hand, this makes the computation more demanding, and increases the error associated with calculation of the specular component.

[0013] Another method of modeling or calculating the specular reflection is known as the Phong method. In accordance With this method, a normal vector is calculated at each vertex of the polygon. The normal vector at other points of the polygon are interpolated from these vertex normals. The normal vector at a particular point or pixel is then normalized, i.e. turned into a unit vector, and the resulting normalized vector is used in the above-referenced light intensity calculation.

[0014] In the example illustrated in FIG. 1, the Phong method requires the calculation of the normal vectors N₅ and N₆ at points P₅ and P₆, as interpolated from the normal vectors at points N₁ and N₃, and N₂ and N₃, respectively. Then, the normal vector N₄ at point P₄ is calculated from the normal vectors N₅ and N₆. This normal vector N₄ is then normalized (i.e. converted to a unit vector) for use in the light intensity calculation.

[0015] This method is discussed in Foley, Van Dam and Addison-Wesley, supra, and in Phong, “Illumination of Computer-Generated Images,” Ph.D. dissertation, Department of Electrical Engineering, University of Utah, July 1973.

[0016] There are several problems with the Phong method. First, the normal vector must be calculated at each point or pixel. In addition, this normal vector must be converted to a unit vector. The transformation of the normal vector into a unit normal vector requires the calculation of the reciprocal square root of the terms of the vector. These calculations are very demanding in terms of computational effort and time. In addition, the dot product of the R and V vectors must still be raised to an arbitrary power n. That this calculation must be done at each point or pixel also increases the calculation demands. As a result, the Phong method is more interesting from a theoretical perspective than actually useful when considering the computational demands of the method.

[0017] A problem associated with use of either of the above-identified models is that the calculation of the specular reflection component requires calculation of the reflection vector R. Because the reflection vector R may change at each point of a surface, the above-equations require the reflection vector R to be re-calculated at each individual point or pixel. Once again, this arrangement is computationally demanding.

[0018] As one attempt to overcome some of the above-stated problems, in the Blinn method of modeling specular highlights, the need for calculating the reflection vector R is eliminated by use of a vector H called the halfway vector. In accordance with this model, the value R·V is replaced with N·H, where H is a vector extending from the point halfway between the N and V vectors, i.e. H=(L+V)/2. The value N·H represents the cosine of the angle γ, as illustrated in FIG. 2. This method is discussed in Blinn, “Models of Light Reflection For Computer Synthesized Pictures,” SIGGRAPH Proceedings, pages 192-198, July 1977.

[0019] When this improvement is applied to the Gouraud shading model, however, the problems associated with light intensity interpolation still exist. If this improvement is applied to the Phong model, the specular component computation is still demanding since the reciprocal square root calculation is still required to normalize the normal vector at the point or pixel under consideration.

[0020] A further attempt to provide a less computationally demanding specular reflectivity model exists in which individual calculations of the intensities are avoided by using a second-degree Taylor expansion to approximate Phong shading data. This method is discussed in Bishop & Weiner, “Fast Phong Shading,” ACM Vol. 20, No. 4, July 1986, pages 103-106.

[0021] This method is still substantially more complex than Gouraud shading, and yet introduces additional approximations as compared to the Phong method.

SUMMARY OF THE INVENTION

[0022] The invention is a method and apparatus for modeling the specular reflection of light from a surface of an object to be graphically imaged.

[0023] In accordance with one embodiment of a method of the invention, a portion of the object to be imaged is modeled with one or more surfaces. In one or more embodiments, the surface comprises a quadratic triangular Bezier surface having three vertices and three edge midpoints.

[0024] A sine value associated with a highlight angle is determined. In at least one embodiment, the sine value comprises the sine squared value of the angle between a normal vector and a halfway vector at each vertex and edge midpoint. A control value is determined at each vertex and edge midpoint based on the sine values.

[0025] A specular input value at one or more other points on the surface is determined from the control values. In one or more embodiments, the specular input value is dependent upon the barycentric coordinates of the particular point in relation to the vertices and edge midpoints. The specular input value at each point is utilized to determine the specular reflection component of light at each point.

[0026] In one or more embodiments, the specular input component at each point is reparametrized to fall within the range of 1 to 0 before being used to calculate the specular reflection component. In at least one embodiment, the reparametrization is accomplished with a cubic spline function.

[0027] In one or more embodiments, the specular component at each point is added to an ambient light component and a diffuse light component to generate a combined light data component for that point.

[0028] In one or more embodiments, computer hardware is arranged to perform the method of the invention.

[0029] Further objects, features, and advantages of the present invention over the prior art will become apparent from the detailed description of the drawings which follows, when considered with the attached figures.

BRIEF DESCRIPTION OF THE DRAWINGS

[0030]FIG. 1 illustrates a triangular polygon used to model a portion of a surface of an object in accordance with a method of the prior art, the polygon having vertices V₁, V₂ and V₃, points P₅ and P₆ along edges extending between vertices V₁ and V₃ and V₂ and V₃, respectively, and a point P₄ positioned along a horizontal scan line between points P₅ and P₆;

[0031]FIG. 2 illustrates the interrelationship of a normal vector N at a point on a surface, along with a light vector L along which incoming light travels and is reflected along a reflection vector R, a viewing vector V along which a viewer views the point, and a halfway vector H;

[0032]FIG. 3 is a flowchart illustrating a method of modeling specular reflection in accordance with one embodiment of the invention;

[0033]FIG. 4 illustrates a quadratic triangular Bezier surface used in a method of modeling specular reflection in accordance with the invention;

[0034]FIG. 5 diagramatically illustrates one embodiment of a computer system capable of providing a suitable execution environment for an embodiment of the invention; and

[0035]FIG. 6 diagramatically illustrates one embodiment of a light component data generator system for use smith the computer system illustrated in FIG. 5.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0036] In general, the invention is an apparatus and method for modeling the specular reflection of light from a surface/object. In the following description, numerous specific details are set forth in order to provide a more thorough description of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In some instances, well-known features may have not been described in detail so as not to obscure the invention.

[0037] Portions of the disclosure of this patent document may contain material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office file or records, but otherwise reserves all copyright rights whatsoever. Java™ and all Java-based trademarks and logos are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries. All SPARC™ trademarks are used under license and are trademarks or registered trademarks of SPARC International in the United States and other countries. Products bearing SPARC trademarks are based upon an architecture developed by Sin Microsystems, Inc.

[0038] Method of Modeling Specular Reflection

[0039] A method of the invention will now be described in more detail with reference first to FIG. 3.

[0040] In accordance with one embodiment of the method, in a first step S1, the surface of an object to be graphically modeled is divided or broken up into one or more surfaces. In one embodiment of the invention, each surface has at least one vertex and at least one edge having an edge point corresponding thereto. In a more specific embodiment of the invention, each surface comprises a quadratic triangular Bezier surface. (Note: Bicubic interpolation has been used to interpolate specular reflection, as discussed by Shantz and Lien in “Shading Bicubic Patches” which appears in the 1987 proceedings of the ACM Siggraph Conference. Quadratic interpolation not using the Bezier formulation has been used to interpolate specular reflection, as described by Kirk and Voorhies in “The Rendering Architecture of the DN 1000VS” which appears in the 1990 proceedings of the ACM Siggraph Conference.) FIG. 4 illustrates such a surface.

[0041] The triangular quadratic Bezier surface and its characteristics are well known to those of skill in the art. In general, this surface has vertices P₀, P₁ and P₂. These vertices P₀, P₁ and P₂ are connected by “edges” generally comprising parabolas.

[0042] Points P₃, P₄ and P₅ are the Bezier midpoints of the quadratic edges of the triangle. Each of these edge midpoints P₃, P₄ and P₅ are positioned off of the parabolic edge, the exact position of which is defined by the intersection of lines T tangent to the edge at the vertices P₀, P₁ and P₂ of that edge, as is well known.

[0043] The position of any point P corresponding to a quadratic Bezier surface can be defined with barycentric coordinates (b_(x), b_(y), b_(z)). In particular, given these barycentric coordinates, and the vertices P₀, P₁ and P₂, as well as the edge midpoints P₃, P₄ and P₅, the point P may be calculated using the vector-valued function:

P=b ₀ ² P ₀ +b ₁ ² P ₂ +b ₂ ² P ₂+2b ₀ b ₁ P ₃+2b ₁ b ₂ P ₄+2b ₂ b ₀ P ₅=(b ₀ P ₀+2b ₁ P ₃)b ₀+(b ₁ P ₁+2b ₂ P ₄)b ₁+(b ₂ P ₂+2b ₀ P ₅)b ₂.

[0044] Referring again to FIG. 3, in a second step S2 of the method, unit normal vectors N₀/N₁ and N₂ are determined at the vertices P₀, P₁ and P₂, in a manner similar to that of the Phong and Gouraud shading methods and well known to those of skill in the art.

[0045] Using the unit normal vectors N₀, N₁ and N₂, in a step S3 the normal vectors N₃. N₄ and N₅ at the midpoint P₃, P₄ and P₅ of each edge of the quadratic surface are determined. In one embodiment of the invention, these normal vectors N₃, N₄ and N₅ at the edge midpoints P₃, P₄ and P₅ are determined by interpolation from the normal vectors N₀, N₁ and N₂ at the vertices P₀, P₁ and P₂ of the particular edge to which the point corresponds. In an embodiment where the interpolation is linear, the normal vector N₃ is calculated by interpolation from the normal vectors N₀ and N₁, the normal vector N₅ is calculated by interpolation from the normal vectors N₀ and N₂, and the normal vector N₄ is calculated by interpolation from the normal vectors N₁ and N₂. The normal vectors N₃, N₄ and N₅ at the midpoints are then converted to unit normal vectors.

[0046] Next, in a step S4, a sine value associated with a “highlight angle” is determined. The term “highlight angle” is intended to mean an angle which serves to define the existence of a specular highlight, such as the angle between the reflection vector R and view vector V (see FIG. 2 above), or an approximation thereto, such as the angle between the normal vector N and halfway vector H (see also FIG. 2 above).

[0047] In one embodiment, the sine value comprises the sine squared value of the angle between the unit normal vectors N₀, N₁, N₂, N₃, N₄ and N₅ at the edge midpoints and the vertices and the halfway vector H at each of these points. This value may be determined from the following calculation:

sine²=(N×H)·(N×H)=1−(N·H)² =s,

[0048] where N×H represents the cross-product between the N and H vectors, and N·H represents the dot product between the N and H vectors.

[0049] As stated above, the H vector man be calculated in accordance with the well known equation H=(L+V)/|L+V|, where |L+V| represents the magnitude of L+V. Use of the H vector avoids computation of the reflection vector R as also described above. In another embodiment, the sine squared value of the angle between the reflection and view vectors R and V may be calculated.

[0050] It is possible to determine only the sine (and not sine squared) of the angle between these vectors in accordance with the equation:

sine=(N×H)=((N×H)·(N×H))^(½).

[0051] In this equation N×H is again the cross-product between the normal vector N and the halfway vector H.

[0052] It is desirable, however, to avoid the use of this equation to eliminate both the need to calculate the more complex cross-product between the vectors and the need to calculate a square root.

[0053] The sine value s defined above is calculated at each point P₀, P₁, P₂, P₃, P₄ and P₅, rendering sine values s₀, s₁, s₂, s₃, s₄ and s₅.

[0054] These sine values (s₀, s₁, s₂, s₃, s₄ and s₅) are then turned into control values for the surface in accordance with a step S5 of the method. When the surface is a quadratic triangular Bezier surface, the control values S₀, S₁, S₂, S₃, S₄ and S₅ are determined in accordance with the equations: S₀ = s₀ S₁ = s₁ S₂ = s₂ S₃ = (4s₃ − s₀ − s₁)/2 S₄ = (4s₄ − s₁ − s₂)/2 S₅ = (4s₅ − s₂ − s₀)/2

[0055] In a step S6, these control values S₀, S₁, S₂, S₃, S₄ and S₅ are then utilized to determine or obtain a “specular input” value “s” at each particular point or pixel. When the surface is a quadratic triangular Bezier surface, this is accomplished by substituting control values S₀, S₁, S₂, S₃, S₄ and S₅ in place of P₀, P₁, P₂, P₃, P₄ and P₅ in the above-referenced equation: $\begin{matrix} {P = {{b_{0}^{2}P_{0}} + {b_{1}^{2}P_{2}} + {b_{2}^{2}P_{2}} + {2b_{0}b_{1}P_{3}} + {2b_{1}b_{2}P_{4}} + {2b_{2}b_{0}P_{5}}}} \\ {{= {{\left( {{{\overset{.}{b}}_{0}P_{0}} + {2b_{1}P_{3}}} \right)b_{0}} + {\left( {{b_{1}P_{1}} + {2b_{2}P_{4}}} \right)b_{1}} + {\left( {{b_{2}P_{2}} + {2b_{0}P_{5}}} \right)b_{2}}}};} \end{matrix}$

[0056] substituting “S” terms:

[0057] s at a particular point or pixel having barycentric coordinates (b₀,b₁,b₂)

S=(b ₀ S ₀+2b ₁ S ₃)b ₀+(b ₁ S ₁+2b ₂ S ₄)b ₁+(b ₂ S ₂+2b ₀ S ₅)b ₂

[0058] An advantage of interpolating using a quadratic triangular Bezier surface, as represented by the above equation, is that even if no specular reflection is present at any of points P₀, P₁, P₂, P₃, P₄ or P₅, the quadratic interpolation may still produce a specular reflection at the interpolated point.

[0059] In accordance with one embodiment of the invention, in a step S7, the “s” or specular input value for a particular point or pixel is scaled to fall in the range from zero to one. This may be accomplished by using the calculated term “s” as the input to a cubic spline function that defines the specular reflection r to be:

r=1−t ²(3−2t);

[0060] where “t” represents a reparametrization of s relative to upper and lower limit terms s_(hi) and s_(lo). Using s_(hi) and s_(lo), s is reparametrized to the interval (0,1), represented by t. Then t is used to calculate r such that when s=s_(hi), r=0 and when s=s_(lo), r=1, with t smoothly transitioning in between:

t=(s−s _(lo))/(s _(hi) −s _(lo))

[0061] In general, however, the values s_(hi) and s_(lo) are chosen knowing that the maximum specular reflection occurs when the viewing vector V lies along the reflection vector R (i.e. an angle of 0 degrees) or the halfway vector H lies along the normal vector N (i.e. an angle of 0 degrees), and quickly tapers off as the angle becomes larger. The exact values of s_(hi) and s_(lo) may be chosen in part based on the surface which is being imaged, knowing that these values will determine the size of the imaged specular reflection. For example, s_(hi) and s_(lo) may comprise the sine (or sine squared values, in the case where the sine squared values are used to calculate the control values) of 0.15 and 0.01 degrees, respectively.

[0062] The reparametrized sine or specular input value “r” at the particular point or pixel can then be used in a step S8 to determine the specular light component at the particular point or pixel in accordance with the following calculation:

I _(specular component) =I _(i) *[k _(s)(r)]

[0063] where I_(i) is the incident light intensity and k_(s) is a spectral-reflection coefficient.

[0064] In this arrangement, the reparametrized specular input value “r” takes the place of the value (R·V)^(n) in the Gouraud and Phong shading methods, and takes the place of the value (N·H)^(n) in the Blinn method, and is simpler to compute than those methods.

[0065] This specular component may then be added to the ambient and diffuse light intensity components to generate a single light intensity output component in accordance with the calculation:

I=I _(a) *k _(a) +I _(i) *[k _(d)(L*N)]+I _(specular component)

[0066] where I_(a) is the ambient light intensity, k_(a) is an ambient coefficient and k_(d) is a diffuse-reflection coefficient.

[0067] Instead of separating the light intensity components, the following light intensity calculation may be utilized to calculate the total light intensity at a point or pixel:

I=I _(a) *k _(a) +I _(i) *[k _(d)(L*N)+k _(s)(r)]

[0068] Those of skill in the art will appreciate that the above-referenced calculations may be performed for different light color components at each particular pixel. In addition, other components or factors may be integrated into the light intensity calculation to compensate for a variety of other factors, such as atmospheric attenuation and the like. In this manner, the resultant light output data for a particular pixel provides the most accurate graphic portrayal of an image.

[0069] It is noted that the specular input value s for a particular point or pixel can be used directly to determine the specular component I (instead of the reparametrized value r, as described above). Use of the reparametrized value r, based on a higher cubic spline function has the advantage of providing a more precise definition of the specular reflection in the generated image.

[0070] The above-described method of modeling the specular reflection has numerous advantages over the prior art methods. This method has been found to be much less computationally demanding than the prior art methods. Yet, the method is very accurate in modeling specular reflection. In particular, the use of the sine function instead of the cosine function provides more accurate results where the angle between the highlight and normal or view and reflection vectors is very small (i.e. the sine value approaches 0). This is important, since the maximum specular reflection occurs when the angle is 0, and falls off dramatically as the angle increases from 0 degrees.

[0071] The accuracy of the method in modeling specular reflection, including as a comparison, the results obtained by using the Phong method, is at least somewhat dependent upon the ability of the quadratic triangular Bezier surface to approximate or model the object surface. It is well known that a Bezier surface can not exactly re-produce a sphere. Accordingly, calculations were used to determine the accuracy of the quadratic triangular Bezier surface in modeling a sphere.

[0072] In this calculation, a single quadratic triangular Bezier surface is used to model one octant of a surface of a sphere. It is assumed that the position of the vertices of the Bezier surface are located at P₀, P₁ and P₂ and that these vertices lie at unit distances along the x, y and z axes, respectively. Accordingly, the Cartesian coordinates of these vertices are (1,0,0), (0,1,0) and (0,0,1). These vertices are joined by a quadratic surface.

[0073] In this arrangement, the surface may be considered as subtending a solid angle of 90 degrees. The radius of this surface about its center (i.e. the point equidistant from the vertices P₀, P₁ and P₂) is 0.896. When the surface subtends smaller angles, the measured radius is as follows: Solid Angle True Radius Model Radius 45 1 0.985 22.5 1 1.0012 11.25 1 0.9998 5.625 1 1.0012 2.8125 1 0.999997

[0074] When high accuracy is demanded, such as to 0.01, it may be seen that the triangular quadratic surface is satisfactory in modeling a true sphere up to subtended angles at or above about 22.5 degrees.

[0075] In some instances, the object to be modeled may need to be modeled with a large number of quadratic triangular Bezier surfaces to minimize the subtended angles. Alternatively, a cubic triangular Bezier surface or other higher order surface may be used instead.

[0076] Those of skill in the art will appreciate that FIG. 3 illustrates one specific arrangement of the method of the invention. Of course, this figure and the method may vary in accordance with the many other embodiments detailed above.

[0077] Embodiment of Computer Execution Environment (Hardware)

[0078] An embodiment of the invention can be implemented as computer software in the form of computer readable code executed on a general purpose computer such as a computer 100 illustrated in FIG. 5, or in the form of bytecode class files executable within a Java™ runtime environment running on such a computer. A keyboard 110 and a mouse 111 are coupled to a system bus 118. The keyboard and mouse are for introducing user input to the computer system and communicating that user input to a processor 113. Other suitable input devices may be used in addition to, or in place of, the mouse 111 and the keyboard 110. An I/O (input/output) unit 119 coupled to a system bus 118 represents such I/O elements as a printer, A/V (audio/video) I/O, etc.

[0079] The computer 100 includes a video memory 114, a main memory 115 and a mass storage 112, all coupled to the system bus 118 along with the keyboard 110, the mouse 111 and the processor 113. The mass storage 112 may include both fixed and removable media, such as magnetic, optical or magnetic optical storage systems or any other available mass storage technology. The bus 118 may contain, for example, sixty-four address lines for addressing a video memory 114 or a main memory 115. The system bus 118 also includes, for example, a 64-bit data bus for transferring data between and among the components, such as the processor 113, the main memory 115, the video memory 114 and the mass storage 112. Alternatively, multiplex data/address lines may be used instead of separate data and address lines.

[0080] In one embodiment of the invention, the processor 113 is a microprocessor manufactured by Sun Microsystems, Inc., such as a SPARC™ microprocessor, or a microprocessor manufactured by Motorola, such as the 680X0 processor, or a microprocessor manufactured by Intel, such as the 80X86, or Pentium processor. However, any other suitable microprocessor or microcomputer may be utilized The main memory 115 is comprised of dynamic random access memory (DRAM). The video memory 114 is a dual-ported video random access memory. One port of the video memory 114 is coupled to a video amplifier 116. The video amplifier 116 is used to drive a cathode ray tube (CRT) raster monitor 117. The video amplifier 116 is well known in the art and may be implemented by any suitable apparatus. This circuitry converts pixel data stored in the video memory 114 to a raster signal suitable for use by the monitor 117. The monitor 117 is a type of monitor suitable for displaying graphic images. Alternatively, the video memory could be used to drive a flat panel or liquid crystal display (LCD), or any other suitable data presentation device.

[0081] The computer 100 may also include a communication interface 120 coupled to the bus 118. The communication interface 120 provides a two-way data communication coupling via a network link 121 to a local network 122. For example, if the communication interface 120 is an integrated services digital network (ISDN) card or a modem, the communication interface 120 provides a data communication connection to the corresponding type of telephone line, which comprises part of the network link 121. If the communication interface 120 is a local area network (LAN) card, the communication interface 120 provides a data communication connection via the network link 121 to a compatible LAN. The communication interface 120 could also be a cable modem or wireless interface. In any such implementation, the communication interface 120 sends and receives electrical, electromagnetic or optical signals which carry digital data streams representing various types of information.

[0082] The network link 121 typically provides data communication through one or more networks to other data devices. For example, the network link 121 may provide a connection through a local network 122 to a local server computer 123 or to data equipment operated by an Internet Service Provider (ISP) 124. The ISP 124 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 125. The local network 122 and Internet 125 both use electrical, electromagnetic or optical signals which carry digital data streams. The signals through the various networks and the signals on the network link 121 and through the communication interface 120, which carry the digital data to and from the computer 100, are exemplary forms of carrier waves transporting the information.

[0083] The computer 100 can send messages and receive data, including program code, through the network(s), the network link 121, and the communication interface 120. In the Internet example, a remote server computer 126 might transmit a requested code for an application program through the Internet 125, the ISP 124, the local network 122 and the communication interface 120.

[0084] The received code may be executed by the processor 113 as it is received, and/or stored in the mass storage 112, or other non-volatile storage for later execution. In this manner, the computer 100 may obtain application code in the form of a carrier wave.

[0085] Application code may be embodied in any form of computer program product. A computer program product comprises a medium configured to store or transport computer readable code or data, or in which computer readable code or data may be embedded. Some examples of computer program products are CD-ROM disks, ROM cards, floppy disks, magnetic tapes, computer hard drives, servers on a network, and carrier waves.

[0086] In one or more embodiments, the computer 100 and/or CPU 113 may include a light component data generator system 130, such as that illustrated in FIG. 6. Such a system 130 may comprise hardware and/or software associated with the computer 100 and/or CPU 113.

[0087] In the arrangement illustrated in FIG. 6, the system 130 includes an ambient light component generator 132, a diffuse light component generator 134, and a specular light component generator 136. The system 130 may be arranged to provide pixel light data which is output to the video memory 115.

[0088] In the embodiment illustrated in FIG. 6, the specular light component generator 136 comprises a surface model generator 138, a normal vector generator 140, a control value generator 142, and a pixel specular component data generator 144. In general, the surface model generator 138 is arranged to accomplish step S1 of the method illustrated in FIG. 3. The normal vector generator 140 is arranged to accomplish steps S2 and S3. The control value generator 142 is arranged to accomplish steps S4 and S5. The pixel specular component data generator 144 is arranged to accomplish step S6 and S8, and if reparametrization is utilized, step S7.

[0089] The computer system described above is specifically arranged to perform the method illustrated in FIG. 3. Of course, the system may be modified or altered to perform other arrangements of the method, as described in detail above.

[0090] The computer systems described above are for purposes of example only. An embodiment of the invention may be implemented in any type of computer system or programming or processing environment, including embedded devices (e.g., web phones, etc.) and “thin” client processing environments (e.g., network computers (NC's), etc.) that support a virtual machine.

[0091] Of course, the foregoing description is that of one or more embodiments of the invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, as defined by the claims. 

What is claimed is:
 1. A method of determining a specular reflection component of an object to be graphically imaged, comprising the steps of: modeling a portion of said object to be imaged with one or more surfaces having at least one vertex and at least one edge having an edge point corresponding thereto; determining a sine value associated with a highlight angle at each vertex and edge point; determining a control value at each vertex and edge point based upon said sine values; determining a specular input value at a particular point on said surface from said control values; and determining a specular reflection component at said point based on said specular input value at said point.
 2. The method in accordance with claim 1 , wherein said surface comprises a quadratic triangular Bezier surface.
 3. The method in accordance with claim 2 , wherein each edge point comprises a midpoint corresponding to each edge of said surface.
 4. The method in accordance with claim 1 , wherein said step of calculating said sine value comprises calculating the sine square value of said angle.
 5. The method in accordance with claim 1 , wherein said highlight angle comprises the angle between a halfway vector and a normal vector at each vertex and edge point.
 6. The method in accordance with claim 1 , wherein said highlight angle comprises the angle between a view vector and a reflection vector at each vertex and edge point.
 7. The method in accordance with claim 1 , wherein said step of determining a specular input value at a particular point comprises determining such a value dependent upon said control values and a positional relationship of said particular point with respect to said vertices and edge points.
 8. The method in accordance with claim 1 , further including the step of reparametrizing said specular input value at said point on a scale between 1 and 0 and wherein said specular reflection component is determined from said reparametrized specular input value.
 9. The method in accordance with claim 1 , further including the step of reparametrizing said specular input value at said point using a cubic spline function.
 10. The method in accordance with claim 8 , wherein said step of reparametrizing comprises obtaining a value r by subtracting a predetermined low specular input value from said specular input value at said point and dividing said result by the difference between a predetermined high specular input value and said low specular input value, producing a value t, and where r=1−t²(3−2t).
 11. The method in accordance with claim 1 , wherein said surface has vertices P₀, P₁ and P₂ and edge points P₃, P₄ and P₅, said control values S₀, S₁, S₂, S₃, S₄ and S₅ at P₀, P₁, P₂, P₃, P₄ and P₅, respectively, comprise s₀, s₁, s₂, (4s₃−s₀−s₁)/2, (4s₄−s₁−s₂)/2 and (4s₅−s₂−s₀)/2, where s₀, s₁, s₂, s₃, s₄ and s₅ represent said sine values at P₀, P₁, P₂, P₃, P₄ and P₅.
 12. The method in accordance with claim 11 , wherein said specular input value at said point comprises (b₀S₀+2b₁S₃)b₀+(b₁S₁+2b₂S₄)b₁+(b₂S₂+2b₀S₅)b₂, where b₀, b₁ and b₂ are barycentric coordinates of said point relative to said vertices P₀, P₁ and P₂.
 13. The method in accordance with claim 1 , wherein said sine value at each vertex and edge midpoint comprises the square of the dot product between a normal vector and a halfway vector, subtracted from the value
 1. 14. The method in accordance with claim 1 , wherein said specular input value is obtained from a set of barycentric coordinates for said point in relation to said vertices and edge points and said sine values at said vertices and edge points.
 15. The method in accordance with claim 1 , further including the step of determining a light data component for said point comprising an ambient light component, a diffuse light component and said specular light component.
 16. A computer program product comprising: a computer usable medium having computer readable program code embodied to model the component of light specularly reflected from an object to be graphically portrayed comprising: computer readable program code configured to model at least a portion of said object with a surface having at least one vertex and at least one edge having an edge point corresponding thereto; computer readable program code configured to cause a computer to determine a sine value associated with a highlight angle at each vertex and edge point; computer readable program code configured to cause a computer to determine a control value at each vertex and edge point based on said sine values; computer readable program code configured to cause a computer to determine a specular input value at a particular point on said surface from said control values; and computer readable program code configured to cause a computer to determine a specular light component at said point based on said specular input value at said point.
 17. The computer program product in accordance with claim 16 , wherein said computer readable program code is configured to model a portion of said object with a triangular quadratic Bezier surface having three vertices and three edges, each edge having a midpoint.
 18. The computer program product in accordance with claim 16 , wherein said computer readable program code configured to cause a computer to determine a sine squared value at each vertex and edge point.
 19. The computer program product in accordance with claim 16 , further including computer readable program code configured to cause a computer to determine a reparametrized value of said specular light component at said point, said reparametrized value having a value between 0 and
 1. 20. A computer system comprising: a processor; a computer program executable by said processor, said program arranged to generate specular light component pixel data, said program modeling a portion of an object with at least one surface having at least one vertex and at least one edge having an edge point corresponding thereto, determining a sine value of a highlight angle at each vertex and edge point, determining a control value at each vertex and edge point based upon said sine values, determining a specular input value at a particular point on said surface from said control values, determining a specular reflection component at said point based on said specular input value at said point corresponding to a pixel; and a video memory for storing said specular light component pixel data generated by said processor.
 21. A computer system comprising: a processor; a video memory for storing said specular light component pixel data generated by a light data component generating system of said computer system, said light data component generating system generating per pixel specular light component data comprising: a surface model generator modeling at least a portion of a surface to be graphically imaged with a surface having at least one vertex and least one edge having an edge point corresponding thereto; a control value generator generating a control value at each of said vertices and edge midpoints based on a sine value of a highlight angle at each vertex and midpoint; and a pixel specular component data generator generating a specular light component pixel data at each pixel based on said control values. 